Applying Heuristic Search for Distributed Software Performance Enhancement
نویسندگان
چکیده
منابع مشابه
Distributed constrained heuristic search
In this paper we present a model of decentralized problem solving, called Distributed Constrained Heuristic Search (DCHS) that provides both structure and focus in individual agent search spaces so as to optimize decisions in the global space. The model achieves this by integrating decentralized constraint satisfaction and heuristic search. It is a formalism suitable for describing a large set ...
متن کاملHeuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint satisfaction problem (CSP). Various distributed and parallel computing approaches have been used to solve these problems. Mainly, these approaches can be classiied as variable-based, domain-based, and function-based distributed problem solving strategies. In this paper, some heu...
متن کاملBuilding Reusable Software Components for Heuristic Search∗
Today, advanced heuristic approaches for discrete optimization are usually implemented from scratch. We discuss some crucial problems that have so far prevented us from having a “heuristics stockroom” with ready-to-use software components available. Then, we analyze the domain to be covered by reusable software and introduce and discuss a design for a framework for heuristic search. Finally, we...
متن کاملParallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm
In this paper, a distributed heuristic search algorithm is presented. We show that the algorithm is admissible and give an informal analysis of its load balancing, scalability, and speedup. A flow-shop scheduling problem has been implemented on a BBN Butterfly Multicomputer using up to 80 processors to empirically test this algorithm. From our experiments, this algorithm is capable of achieving...
متن کاملApplying Probabilistic Inference to Heuristic Search by Estimating Variable Bias
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a variable a particular value. Intuitively such constructs would seem important to efficient search, but their study to date has assumed a mostly conceptual perspective, in terms of indicating problem hardness or motivat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2009
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2009.23021